Proving Safety Properties for EmbeddedControl
نویسندگان
چکیده
It is well-known that a fundamental problem in embedded control systems is the veriication of the safety requirements. Formal methods and related support tools can successfully be applied in the formal proof that a system is safe. However, the complexity of real systems is such that automated tools often fail to formally validate such systems. A typical case is when \state explosion" problems arise. In this paper, we show some \abstraction techniques" to make the problem of safety requirements validation tractable by current tools. These abstraction techniques have been deened inside a veriication methodology that has been tested on the speciication of a railway computer based interlocking signalling control system. The conditions under which this methodology can be applied to systems in diierent application areas are nally discussed.
منابع مشابه
Automatically Proving Unity Safety Properties with Arrays and Quantiiers
We address the general problem of automatically proving safety properties of reactive systems within the Unity model. We take up a relational and set-based approach, and deene some techniques to represent instructions and properties, allowing us to deal with arrays and quantiication. An integration of these techniques into the Omega calculator, which we make use of with a signiicant example, no...
متن کاملAutomatically Proving UNITY Safety Properties with Arrays and Quantifiers
We address the general problem of automatically proving safety properties of reactive systems within the UNITY model. We take up a relational and set-based approach, and define some techniques to represent instructions and properties, allowing us to deal with arrays and quantification. An integration of these techniques into the OMEGA calculator, which we make use of with a significant example,...
متن کاملOn Proving Safety Properties by Integrating Static Analysis, Theorem Proving and Abstraction
We present a new approach for proving safety properties of reactive systems, based on tight interaction between static analysis, theorem proving and abstraction techniques. The method incrementally constructs a proof or nds a counterexample. Every step consists of applying one of the techniques and makes constructive use of information obtained from failures in previous steps. The amount of use...
متن کاملOn Proving Safety Properties
We present a new approach for proving safety properties of reactive systems, based on tight interaction between static analysis, theorem proving and abstraction techniques. The method incrementally constructs a proof or nds a counterexample. Every step consists of applying one of the techniques and makes constructive use of information obtained from failures in previous steps. The amount of use...
متن کاملTowards Type Safety of Aspect-Oriented Languages
In this paper we describe our vision of supporting aspectoriented programming with interactive theorem proving in Coq. The goal is to construct a mechanized semantical basis that enables the analysis of type safety and other security properties. This basis consists of a featherweight aspectoriented language and a supporting framework for analysis. We identify features of aspect-oriented program...
متن کامل